Watson-crick (D)0 L systems: a survey

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

A Short Survey on Watson-Crick Automata

This paper surveys some known results in Watson-Crick automata theory. In particular, we concentrate on the computational power, complexity measures, decidability problems, and systems of Watson-Crick automata working together on the same input. This selection of topics is not exhaustive, reflecting the research interests of the authors. A series of open problems and questions is also included.

Power and size of extended Watson-Crick L systems

Uni-transitional Watson-crick D0l Systems Uni-transitional Watson-crick D0l Systems

The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementarity as a language-theoretic operation: \bad" words obtained through a generative process are repl...

Watson-Crick D0L systems with regular triggers